Simplifying Polygonal Approximation of 2D Shapes

ثبت نشده
چکیده

Shape Approximation requires simplifying a polygonalization of a smooth shape S with another polygonalization that has fewer number of vertices. The computed polygonalization should be homeomorphic to S and geometrically close to it. We present an algorithm that can provably simplify the initial polygonalization when the sampling density is high enough with respect to the feature size of the boundary of the shape S. Our algorithm is based on a simple weighted decimation algorithm which calculates it’s weight from the circumradius-to-shortest edge ratio U O that is a well known metric in mesh generation for producing good quality triangulations. Our Implementation clearly shows that our output surpasses our theoretical guarantees.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate General Sweep Boundary of a 2D Curved Object,

This paper presents an algorithm to compute an approximation to the general sweep boundary of a 2D curved moving object which changes its shape dynamically while traversing a trajectory. In eeect, we make polygonal approximations to the trajectory and to the object shape at every appropriate instance along the trajectory so that the approximated polygonal sweep boundary is within a given error ...

متن کامل

Translational Covering of Closed Planar Cubic B-Spline Curves

Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering decision problems for shapes bounded by spline curves. As a first step in addressing these problems, this paper treats translational spline covering for planar, uniform, cubic B-splines. Inner and outer polygonal approxim...

متن کامل

TOPOLOGY OPTIMIZATION OF 2D BUILDING FRAMES UNDER ARTIFICIAL EARTHQUAKE GROUND MOTIONS USING POLYGONAL FINITE ELEMENT METHOD

In this article, topology optimization of two-dimensional (2D) building frames subjected to seismic loading is performed using the polygonal finite element method. Artificial ground motion accelerograms compatible with the design response spectrum of ASCE 7-16 are generated for the response history dynamic analysis needed in the optimization. The mean compliance of structure is minimized as a t...

متن کامل

Polyline Simpliication Using Quadric Error Metric with Bounded Error Polyline Simpliication Using Quadric Error Metric with Bounded Error Polyline Simpliication Using Quadric Error Metric with Bounded Error

We study the problem of polygonal line simpliication. The objective is to seek a polygonal line of smaller size that approximates the original one well. We present an algorithm that is based on edge contraction. An edge contraction merges two adjacent vertices into a new vertex and this new vertex will be made the new endpoint of the uncontracted edges incident to the two vertices merged. Thus,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998